ALGORITHMS FOR NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMSBERTSEKAS DP.1979; LECTURE NOTES CONTROL INFORM. SCI.; DEU; DA. 1979; VOL. 14; NO 210-224; BIBL. 9 REF.Conference Paper

DYNAMIC PROGRAMMING AND STOCHASTIC CONTROL.BERTSEKAS DP.1976; MATH. SCI. ENGNG; U.S.A.; DA. 1976; VOL. 125; PP. (412P.); BIBL. 7 P. 1/2; ISBN 0120932504Serial Issue

ON THE CONVERGENCE PROPERTIES OF SECOND-ORDER MULTIPLIER METHODSBERTSEKAS DP.1978; J. OPTIMIZ. THEORY APPL.; USA; DA. 1978; VOL. 25; NO 3; PP. 443-449; BIBL. 8 REF.Article

DECOMPOSITION ALGORITHMS FOR LARGE-SCALE NONCONVEX OPTIMIZATION PROBLEMS.BERTSEKAS DP.1976; IN: CONF. DECIS. CONTROL. SYMP. ADAPT. PROCESSES. 15. PROC.; CLEARWATER, FLA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 531-536; BIBL. 18 REF.Conference Paper

MONOTONE MAPPINGS IN DYNAMIC PROGRAMMING.BERTSEKAS DP.1975; IN: CONF. DECIS. CONTROL. SYMP. ADAPT. PROCESSES. 14. PROC.; HOUSTON, TEX.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 20-25; BIBL. 16 REF.Conference Paper

NECESSARY AND SUFFICIENT CONDITIONS FOR EXISTENCE OF AN OPTIMAL PORTFOLIO.BERTSEKAS DP.1974; J. ECON. THEORY; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 235-247; BIBL. 5 REF.Article

DISTRIBUTED DYNAMIC PROGRAMMING = PROGRAMMATION DYNAMIQUE DISTRIBUEEBERTSEKAS DP.1982; IEEE TRANS. AUTOMAT. CONTROL; ISSN 0018-9286; USA; DA. 1982; VOL. 27; NO 3; PP. 610-616; BIBL. 8 REF.Article

MULTIPLIER METHODS: A SURVEY.BERTSEKAS DP.1975; IN: INT. FED. AUTOM. CONTROL. WORLD CONGR. 6. PROC.; BOSTON, CAMBRIDGE, MASS.; 1975; PITTSBURGH, PA.; INSTRUM. SOC. AM.; DA. 1975; VOL. 1; PP. 57.2.1-57.2.13; BIBL. 2 P. 1/2Conference Paper

ON THE METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING. = A PROPOS DE LA METHODE DES MULTIPLICATEURS EN PROGRAMMATION CONVEXEBERTSEKAS DP.1975; I.E.E.E. TRANS. AUTOMAT. CONTROL; U.S.A.; DA. 1975; VOL. 20; NO 3; PP. 385-388; BIBL. 11 REF.Article

PARTIAL CONJUGATE GRADIENT METHODS FOR A CLASS OF OPTIMAL CONTROL PROBLEMS. = METHODES DE GRADIENT PARTIELLEMENT CONJUGUE APPLIQUEES A UNE CLASSE DE PROBLEMES DE COMMANDE OPTIMALEBERTSEKAS DP.1974; I.E.E.E. TRANS. AUTOMAT. CONTROL; U.S.A.; DA. 1974; VOL. 19; NO 3; PP. 209-217; BIBL. 28 REF.Article

DYNAMIC BEHAVIOR OF SHORTEST PATH ROUTING ALGORITHMS FOR COMMUNICATION NETWORKSBERTSEKAS DP.1982; IEEE TRANS. AUTOMAT. CONTROL; ISSN 0018-9286; USA; DA. 1982; VOL. 27; NO 1; PP. 60-74; BIBL. 13 REF.Article

ENLARGING THE REGION OF CONVERGENCE OF NEWTON'S METHOD FOR CONSTRAINED OPTIMIZATIONBERTSEKAS DP.1982; J. OPTIM. THEORY APPL.; ISSN 0022-3239; USA; DA. 1982; VOL. 36; NO 2; PP. 221-252; BIBL. 28 REF.Article

APPROXIMATION PROCEDURES BASED ON THE METHOD OF MULTIPLIERS.BERTSEKAS DP.1977; J. OPTIMIZ. THEORY APPL.; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 487-510; BIBL. 15 REF.Article

A MODEL FOR UNCOORDINATED DISTRIBUTED COMPUTATION OF FIXED POINTSBERTSEKAS DP.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 291-295; BIBL. 4 REF.Conference Paper

PENALTY AND MULTIPLIER METHODSBERTSEKAS DP.1980; NONLINEAR OPTIMIZATION. THEORY AND ALGORITHMS. INTERNATIONAL SUMMER SCHOOL/1979/BERGAMO; USA; BOSTON: BIRKHAEUSER; DA. 1980; PP. 253-278Conference Paper

ON ERROR BOUNDS FOR SUCCESSIVE APPROXIMATION METHODS.BERTSEKAS DP.1976; I.E.E.E. TRANS. AUTOMAT. CONTROL; U.S.A.; DA. 1976; VOL. 21; NO 3; PP. 394-396; BIBL. 6 REF.Article

ON THE GOLDSTEIN-LEVITIN-POLIAK GRADIENT PROJECTION METHOD.BERTSEKAS DP.1976; I.E.E.E. TRANS. AUTOMAT. CONTROL; U.S.A.; DA. 1976; VOL. 21; NO 2; PP. 174-184; BIBL. 21 REF.Article

A NEW ALGORITHM FOR SOLUTION OF RESISTIVE NETWORKS INVOLVING DIODES.BERTSEKAS DP.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 10; PP. 599-608; BIBL. 25 REF.Article

COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION. = METHODES COMBINEES PRIMALES-DUALES A PENALITES, SERVANT POUR LA MINIMISATION SOUS CONTRAINTESBERTSEKAS DP.1975; S.I.A.M. J. CONTROL; U.S.A.; DA. 1975; VOL. 13; NO 3; PP. 521-544; BIBL. 2 P.Article

CONVERGENCE OF DISCRETIZATION PROCEDURES IN DYNAMIC PROGRAMMING. = CONVERGENCE DES PROCEDURES DE DISCRETISATION EN PROGRAMMATION DYNAMIQUEBERTSEKAS DP.1975; I.E.E.E. TRANS. AUTOMAT. CONTROL; U.S.A.; DA. 1975; VOL. 20; NO 3; PP. 415-419; BIBL. 19 REF.Article

NECESSARY AND SUFFICIENT CONDITIONS FOR A PENALTY METHOD TO BE EXACT.BERTSEKAS DP.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 9; NO 1; PP. 87-99; BIBL. 16 REF.Article

PROJECTED NEWTON METHODS FOR OPTIMIZATION PROBLEMS WITH SIMPLE CONSTRAINTSBERTSEKAS DP.1982; SIAM J. CONTROL OPTIM.; ISSN 0363-0129; USA; DA. 1982; VOL. 20; NO 2; PP. 221-246; BIBL. 22 REF.Article

A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEMBERTSEKAS DP.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 2; PP. 152-171; BIBL. 12 REF.Article

CONVEXIFICATION PROCEDURES AND DECOMPOSITION METHODS FOR NONCONVEX OPTIMIZATION PROBLEMSBERTSEKAS DP.1979; J. OPTIMIZ. THEORY APPL.; USA; DA. 1979; VOL. 29; NO 2; PP. 169-197; BIBL. 17 REF.Article

MONOTONE MAPPINGS WITH APPLICATION IN DYNAMIC PROGRAMMING.BERTSEKAS DP.1977; S.I.A.M. J. CONTROL OPTIMIZ.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 438-464; BIBL. 12 REF.Article